Multiplicative structures in additively large sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative structures in additively large sets

Previous research extending over a few decades has established that multiplicatively large sets (in any of several interpretations) must have substantial additive structure. We investigate here the question of how much multiplicative structure can be found in additively large sets. For example, we show that any translate of a set of finite sums from an infinite sequence must contain all of the ...

متن کامل

Approximate Polynomial Structure in Additively Large Sets

In [1], the authors introduced a measure space, obtained by taking a quotient of a Loeb measure space, that has the property that multiplication is measure-preserving and for which standard sets of positive logarithmic density have positive measure. The log Banach density of a standard set (see Section 2 below for the definition) was also introduced, and this measure space framework was used, i...

متن کامل

Additive and Multiplicative Structures of C ? - Sets

It is known that for an IP? set A in (N,+) and a sequence hxnin=1 in N, there exists a sum subsystem hynin=1 of hxnin=1 such that FS(hynin=1) [ FP (hynin=1) ✓ A. Similar types of results have also been proved for central? sets where the sequences have been considered from the class of minimal sequences. In this present work, we shall prove some analogous results for C?-sets for a more general c...

متن کامل

On Multiplicative Entropy and Information gain in Large Data Sets

Information theory is one of the widely used branches of applied probability theory. When probability is used to describe the state of a system implies that the state has some uncertainty. Some probability distributions indicate more uncertainty than others as they are not created equal. We can come up with some mathematical entity which returns a measure of uncertainty after taking a probabili...

متن کامل

On Multiplicative Sidon Sets

Fix integers b > a ≥ 1 with g := gcd(a, b). A set S ⊆ N is {a, b}-multiplicative if ax 6= by for all x, y ∈ S. For all n, we determine an {a, b}-multiplicative set with maximum cardinality in [n], and conclude that the maximum density of an {a, b}-multiplicative set is b b+g . Erdős [2, 3, 4] defined a set S ⊆ N to be multiplicative Sidon1 if ab = cd implies {a, b} = {c, d} for all a, b, c, d ∈...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2006

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2005.11.003